Combinatorics of topmost discs of multi-peg Tower of Hanoi problem
نویسندگان
چکیده
Combinatorial properties of the multi-peg Tower of Hanoi problem on n discs and p pegs are studied. Top-maps are introduced as maps which reflect topmost discs of regular states. We study these maps from several points of view. We also count the number of edges in graphs of the multi-peg Tower of Hanoi problem and in this way obtain some combinatorial identities.
منابع مشابه
Explorations in 4-peg Tower of Hanoi
Finding an optimal solution to the 4-peg version of the classic Tower of Hanoi problem has been an open problem since the 19th century, despite the existence of a presumed-optimal solution. We verify that the presumed-optimal Frame-Stewart algorithm for 4-peg Tower of Hanoi is indeed optimal, for up to 20 discs. We also develop a distributed Tower of Hanoi algorithm, and present 2D and 3D repre...
متن کاملThe Group of Symmetries of the Tower of Hanoi Graph
The classical Tower of Hanoi puzzle, invented by the French mathematician Édourd Lucas in 1883, consists of 3 wooden pegs and n disks with pairwise different diameters. The n disks are initially stacked on a single peg in order of decreasing size, from the largest at the bottom to the smallest at the top. (See Figure 1.) The goal is to move the tower of disks to another peg, moving one topmost ...
متن کاملOn the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem
It is proved that seven different approaches to the multi-peg Tower of Hanoi problem are all equivalent. Among them the classical approaches of Stewart and Frame from 1941 can be found.
متن کاملComplexity of the Path Multi-Peg Tower of Hanoi
The Tower of Hanoi problem with h ≥ 4 pegs is long known to require a sub-exponential number of moves in order to transfer a pile of n disks from one peg to another. In this paper we discuss the Pathh variant, where the pegs are placed along a line, and disks can be moved from a peg to its nearest neighbor(s) only. Whereas in the simple variant there are h(h − 1)/2 bi-directional interconnectio...
متن کاملRecent Progress in Heuristic Search: A Case Study of the Four-Peg Towers of Hanoi Problem
We integrate a number of new and recent advances in heuristic search, and apply them to the fourpeg Towers of Hanoi problem. These include frontier search, disk-based search, parallel processing, multiple, compressed, disjoint, and additive pattern database heuristics, and breadth-first heuristic search. New ideas include pattern database heuristics based on multiple goal states, a method to re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ars Comb.
دوره 59 شماره
صفحات -
تاریخ انتشار 2001